Finding Minimum Cost Spanning Tree on Bidirectional Linear Systolic Array∗
نویسندگان
چکیده
In this paper a bidirectional linear systolic array (BLSA) that computes minimum cost spanning tree (MCST) of a given graph is designed. We present a synthesis procedure, based on data dependencies and space-time transformations of index space, to design BLSA with optimal number of processing elements (PEs) for a given problem size. The execution time is minimized for that number of PEs. Explicit mathematical formulas for systolic array synthesis are derived. We compare performances of the BLSA with the unidirectional linear systolic array (ULSA).
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملA Lagrangian Relaxation Approach to the Generalized Minimum Spanning Tree Problem
The Generalized Minimum Spanning Tree Problem, denoted GMST, is a variant of the classical Minimum Spanning Tree problem, and consists of finding a minimum-cost tree spanning a subset of nodes which includes exactly one node from every cluster in an undirected graph whose nodes are partitioned into clusters and whose edges are defined between nodes belonging to different clusters. The GMST prob...
متن کاملGeneralized Spanning Trees and Extensions
In this dissertation, network design problems where a global network interconnects at minimum cost local networks together (telecommunication, transportation networks) are considered. The generalized minimum spanning tree problem is defined on a graph where the vertex set is partitioned into clusters and a nonnegative cost is associated to each edge. It consists of finding a tree with minimum c...
متن کاملConstant-time Algorithms for Minimum Spanning Tree and Related Problems on Processor Array with Reconfigurable Bus Systems
A processor array with a reconfigurable bus system is a parallel computation model that consists of a processor array and a reconfigurable bus system. In this paper, a constant-time algorithm is proposed on this model for finding the cycles in an undirected graph. We can use this algorithm to decide whether a specified edge belongs to the minimum spanning tree of the graph or not. This cycle-fi...
متن کاملA linear programming approach to increasing the weight of all minimum spanning trees
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so that the value of all minimum spanning trees is equal to some target value. We formulate this as a combinatorial linear program and give an algorithm. Mots clés : Arbres couvrants de poids minimum, sécurisation des réseaux.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009